import java.util.ArrayList;
import java.util.List;

/**
 * TCSS 343.
 * Homework 6B.
 * Power-Grid.
 * 
 * 
 * @author Sean, Michael, Krisnil.
 * @version May 22nd, 2011.
 *
 */
public class PowerGrid {
	/**
	 * Graph Input.
	 */
	private static GraphInput graphInput = new GraphInput();
	/**
	 * Simple Graph.
	 */
	private static SimpleGraph simpleGraph = new SimpleGraph();
	/**
	 * Result contains set of edges and total cost of the minimum spanning tree.
	 */
	private static List<String> result = new ArrayList<String>();;
	
	private static Edge edge;

	
	
	/**
	 * Main
	 * 
	 * @param args
	 */
	public static void main (String args[]) {
        SimpleGraph G;
        G = new SimpleGraph();
        graphInput.LoadSimpleGraph(simpleGraph);        
        prims_algorithm();
        
  }
    
	/** Prim's algorithm implementation to determine the minimum spanning tree
	 *  of a given graph.
	 *  
	 * @return set of edges in the minimum spanning tree.
	 */
	private static List<String> prims_algorithm(){
		
		System.out.println("Set of edges and total cost for the minimum spanning tree:");
		
		//System.out.println(simpleGraph.numEdges());

		// code goes here
		// retrieve graph data from table. 
		
		return result;
	}

}
